Dual Space Search During Scientific Reasoning
نویسندگان
چکیده
منابع مشابه
Dual Space Search During Scientific Reasoning
The purpose of the two studies reported here wos to develop an integrated model of the scientific reasoning process. Subjects were placed in a simulated scientific discovery context by first teaching them how to use an electronic device and then asking them to discover how a hitherto unencountered function worked. To do this task. subjects had to formulate hypotheses bas’ed on their prior knowl...
متن کاملAn extended dual search space model of scientific discovery learning
An extended dual search space model of scientific discovery learning Wouter R. van Joolingen & Ton de Jong Instructional Science, 1997, Vol. 25, 307-346 Introduction ▶ 発見学習は注目を取り戻している 強力な教育シミュレーション環境に利用できる 発見による学習インストラクションへのアプローチの中枢となる ▶ 発見学習の詳細なセオリーが必要 SDDSの拡張としての詳細なセオリーとその検証 Scientific discovery learning ▶ 発見学習とは...与えられたドメインの属性を推論すること 科学的発見学習:実験のデザインが必要 ▶ 科学的発見学習と科学的発見の違い 科学的発見学習では発見が行われる環境は発...
متن کاملRule-Based Reasoning using State Space Search
Semantic Web reasoners are powerful tools that allow the extraction of implicit information from RDF data. This information is reachable through the definition of ontologies and/or rules provided to the reasoner. To achieve this, various algorithms are used by different reasoners. In this paper, we explain how state space search can be applied to create a backward-chaining rule-based reasoner. ...
متن کاملConstrained Discrete Optimization via Dual Space Search
This paper proposes a novel algorithm for solving NP-hard constrained discrete minimization problems whose unconstrained versions are solvable in polynomial time such as constrained submodular function minimization. Applications of our algorithm include constrained MAP inference in Markov Random Fields, and energy minimization in various computer vision problems. Our algorithm assumes the exist...
متن کاملI-dual: Solving Constrained SSPs via Heuristic Search in the Dual Space
We consider the problem of generating optimal stochastic policies for Constrained Stochastic Shortest Path problems, which are a natural model for planning under uncertainty for resourcebounded agents with multiple competing objectives. While unconstrained SSPs enjoy a multitude of efficient heuristic search solution methods with the ability to focus on promising areas reachable from the initia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cognitive Science
سال: 1988
ISSN: 0364-0213
DOI: 10.1207/s15516709cog1201_1